Systolic Generation of combinations from Arbitrary Elements

A systolic algorithm is described for generating, in lexicographically ascending order, all combinations of rn o$ects chosen from an arbitrary set of n elements. The algorithm is designed to be executed on a linear array of zn processors, each having consta.nt size memory (except processor rn, which has O(n) memory), and each being responsible fot producing one element of a given combination. There is a constant delay per combination, leading to an O(C(rn, rz)) time solution, where C(rn, n) is the total number of combinations. The 'lgorithm is cost-optimal (assuming the time to output the combinations is counted), a,nd does not deal with very large integers, Kellwoxbt Combinations, linear array of processors, generating combinatorial objects.